Divisibility of the Hamming Weight by 2k and Monomial Criteria for Boolean Functions
نویسنده
چکیده
In this paper we consider the notions of the Hamming weight and the algebraic normal form. We solve an open problem devoted to checking divisibility of the weight by 2. We generalize the criterion for checking the evenness of the weight in two ways. Our main result states that for checking whether the Hamming weight of f is divisible by 2, k > 1, it is necessary and sufficient to know its algebraic normal form accurate to an additive constant.
منابع مشابه
On the Primary Constructions of Vectorial Boolean Bent Functions∗
Vectorial Boolean bent functions, which possess the maximal nonlinearity and the minimum differential uniformity, contribute to optimum resistance against linear cryptanalysis and differential cryptanalysis for the cryptographic algorithms that adopt them as nonlinear components. This paper is devoted to the new primary constructions of vectorial Boolean bent functions, including four types: ve...
متن کاملThird-order nonlinearities of some biquadratic monomial Boolean functions
In this paper, we estimate the lower bounds on third-order nonlinearities of some biquadratic monomial Boolean functions of the form Trn 1(λx d) for all x ∈ F2n , where λ ∈ F2n , (1) d = 2i +2 j +2k +1, i, j,k are integers such that i > j > k ≥ 1 and n > 2i. (2) d = 23` +22` +2` +1, ` is a positive integer such that gcd(i,n) = 1 and n > 6.
متن کاملDesign of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria
A Boolean function f satis es PC(l) of order k if f(x) f(x ) is balanced for any such that 1 W ( ) l even if any k input bits are kept constant, where W ( ) denotes the Hamming weight of . This paper shows the rst design method of such functions which provides deg(f) 3. More than that, we show how to design \balanced" such functions. High nonlinearity and large degree are also obtained. Further...
متن کاملEvolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography
The role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of desig...
متن کاملNonlinearity of quartic rotation symmetric Boolean functions
Nonlinearity of rotation symmetric Boolean functions is an important topic on cryptography algorithm. Let e ≥ 1 be any given integer. In this paper, we investigate the following question: Is the nonlinearity of the quartic rotation symmetric Boolean function generated by the monomial x0xex2ex3e equal to its weight? We introduce some new simple sub-functions and develop new technique to get seve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2006 شماره
صفحات -
تاریخ انتشار 2006